Characterizations of Convex Vector Functions and Optimization
نویسندگان
چکیده
In this paper we characterize nonsmooth convex vector functions by first and second order generalized derivatives. We also prove optimality conditions for convex vector problems involving nonsmooth data.
منابع مشابه
Farkas-type results for max-functions and applications
In the paper [9], Mangasarian introduced a new approach in order to give dual characterizations for different set containment problems. He succeeded to characterize the containment of a polyhedral set in another polyhedral set and in a reverse convex set defined by convex quadratic constraints and the containment of a general closed convex set in a reverse convex set defined by convex nonlinear...
متن کاملFarkas-Type Results for Vector-Valued Functions with Applications
The main purpose of this paper consists of providing characterizations of the inclusion of the solution set of a given conic system posed in a real locally convex topological space into a variety of subsets of the same space de ned by means of vector-valued functions. These Farkas-type results are used to derive characterizations of the weak solutions of vector optimization problems (including ...
متن کاملConcepts and techniques of optimization on the sphere
In this paper some concepts and techniques of Mathematical Programming are extended in an intrinsic way from the Euclidean space to the sphere. In particular, the notion of convex functions, variational problem and monotone vector fields are extended to the sphere and several characterizations of these notions are shown. As an application of the convexity concept, necessary and sufficient optim...
متن کاملLagrange Multiplier Characterizations of Solution Sets of Constrained Nonsmooth Pseudolinear Optimization Problems
This paper deals with the minimization of a class of nonsmooth pseudolinear functions over a closed and convex set subject to linear inequality constraints. We establish several Lagrange multiplier characterizations of the solution set of the minimization problem by using the properties of locally Lipschitz pseudolinear functions. We also consider a constrained nonsmooth vector pseudolinear opt...
متن کاملSequential Characterization of Solutions in Convex Composite Programming and Applications to Vector Optimization
When characterizing optimal solutions of both scalar and vector optimization problems usually constraint qualifications have to be satisfied. By considering sequential characterizations, given for the first time in vector optimization in this paper, this drawback is eliminated. In order to establish them we give first of all sequential characterizations for a convex composed optimization proble...
متن کامل